Non-differentiable second order symmetric duality in mathematical programming with F-convexity
نویسندگان
چکیده
A pair of Wolfe type non-differentiable second order symmetric primal and dual problems in mathematical programming is formulated. The weak and strong duality theorems are then established under second order F-convexity assumptions. Symmetric minimax mixed integer primal and dual problems are also investigated. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Second Order Mixed Symmetric Duality in Non-differentiable Multi-objective Mathematical Programming
A pair of Mond-Weir type second order mixed symmetric duals is presented for a class of non-differentiable multi-objective nonlinear programming problems with multiple arguments. We establish duality theorems for the new pair of dual models under second order generalized convexity assumptions. This mixed second order dual formulation unifies the two existing second order symmetric dual formulat...
متن کاملMixed symmetric duality in non-differentiable multiobjective mathematical programming
Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...
متن کاملHigher-order symmetric duality for a class of multiobjective fractional programming problems
Correspondence: gaoyingimu@163. com Department of Mathematics, Chongqing Normal University, Chongqing 400047, China Abstract In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, a, r, d)-convexity, which extends some kinds of generalized convexity, such as second or...
متن کاملSymmetric Duality for Mathematical Programming in Complex Spaces with Second Order F-univexity
Bector et al., (1994) introduced the concept of univexity. Mishra (1998), Mishra and Reuda (2001) and Mishra et al., (2005) have applied and generalized these functions. Mathematical programming in complex spaces originated from Levinson’s discussion of linear problems (Levinson, 1966). Mishra and Reuda (2003) have generalized these upto first orders, second order with symmetric duality. Furthe...
متن کاملContinuous Optimization Multiobjective second - order symmetric duality with F - convexity q
We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F -convexity conditions. 2004 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 144 شماره
صفحات -
تاریخ انتشار 2000